A note on minimum K2, 3-saturated graphs
نویسندگان
چکیده
A graph G is said to be K2,3-saturated if G contains no copy of K2,3 as a subgraph, but for any edge e in the complement of G the graph G + e does contain a copy of K2,3. The minimum number of edges of a K2,2-saturated graph of given order n was precisely determined by Ollmann [6]. Here, we determine the asymptotic behavior for the minimum number of edges in a K2,3-saturated graph.
منابع مشابه
Degree-constrained 2-partitions of graphs
A (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G satisfying that δ(G[Vi]) ≥ ki for i = 1, 2. We determine, for all positive integers k1, k2, the complexity of deciding whether a given graph has a (δ ≥ k1, δ ≥ k2)-partition. We also address the problem of finding a function g(k1, k2) such that the (δ ≥ k1, δ ≥ k2)-partition problem is NP-complete for the class of gra...
متن کاملA note on the saturation number of the family of k-connected graphs
Given a family of graphs F , a graph G is F-saturated if no member of F is a subgraph of G, but for all e ∈ E(G), some member of F is a subgraph of G+ e. The saturation number of F , denoted sat(n,F), is the minimum number of edges in an n-vertex F-saturated graph. In this note we determine the saturation number for the family of k-connected graphs.
متن کاملMinimum degree and the minimum size of Kt 2 - saturated graphs Ronald
A graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+ e contains a copy of F as a subgraph for any edge e contained in the complement of G. Erdős et al. in [A problem in graph theory, Amer. Math. Monthly 71 (1964) 1107–1110.] determined the minimum number of edges, sat(n, F ), such that a graph G on n vertices must have when F is a t-clique. Later, Ollmann [...
متن کاملMinimum cycle bases for direct products of K2 with complete graphs
We construct a minimum cycle basis for the direct product K2 × Kp of two complete graphs where p ≥ 2. For p > 3, these bases consists only of squares. This completes the work of R. Hammack, who treated the case Kp ×Kq for p, q ≥ 3 [Inform. Process. Lett. 102 (2007), 214–218.]
متن کاملOn the Number of Edges in a Minimum C6-Saturated Graph
A graph is said to be Ck-saturated if it contains no cycles of length k but does contain such a cycle after the addition of any edge in the complement of the graph. Determining the minimum size of Ck-saturated graphs is one of the interesting problems on extremal graphs. The exact minimum sizes are known for k = 3, 4 and 5, but only general bounds are shown for k ≥ 6. This paper deals with boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 40 شماره
صفحات -
تاریخ انتشار 2008